<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Easy
  </div>
  <div>
   <h1 class="question_title">
    409. Longest Palindrome
   </h1>
   <p>
    Given a string which consists of lowercase or uppercase letters, find the length of the longest palindromes that can be built with those letters.
   </p>
   <p>
    This is case sensitive, for example
    <code>
     "Aa"
    </code>
    is not considered a palindrome here.
   </p>
   <p>
    <b>
     Note:
    </b>
    <br>
    Assume the length of given string will not exceed 1,010.
   </p>
   <p>
    <b>
     Example:
    </b>
   </p>
   <pre>
Input:
"abccccdd"

Output:
7

Explanation:
One longest palindrome that can be built is "dccaccd", whose length is 7.
</pre>
  </div>
  <div>
   <h1 class="question_title">
    409. 最长回文串
   </h1>
   <p>
    给定一个包含大写字母和小写字母的字符串，找到通过这些字母构造成的最长的回文串。
   </p>
   <p>
    在构造过程中，请注意区分大小写。比如&nbsp;
    <code>
     "Aa"
    </code>
    &nbsp;不能当做一个回文字符串。
   </p>
   <p>
    <strong>
     注意:
    </strong>
    <br>
    假设字符串的长度不会超过 1010。
   </p>
   <p>
    <strong>
     示例 1:
    </strong>
   </p>
   <pre>
输入:
"abccccdd"

输出:
7

解释:
我们可以构造的最长的回文串是"dccaccd", 它的长度是 7。
</pre>
  </div>
 </body>
</html>